Graph Pattern Mining, Search and OLAP

نویسنده

  • Xifeng Yan
چکیده

The existing studies are mostly focused on the multiple graphs scenario. With some modifications, the mining methodology can be extended to the single graph scenario [30]. Washio and Motoda [56] conducted a survey on graph-based data mining. Holder et al. [21] proposed SUBDUE to do subgraph pattern discovery based on minimum description length and background knowledge. The most popular graph pattern mining algorithms adapt either Apriori-based or pattern-growth approach. In an Apriori-based approach, the search for frequent subgraphs starts with graphs of small size, and proceeds in a bottom-up manner. At each

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enterprise Architecture Model that Enables to Search for Patterns of Statistical Information

Enterprise architecture is the stem from which developing of any departmental information system should grow and around which it should revolve. In the paper, a fragment of an enterprise architecture model is built using ArchiMate language. This fragment enables to search for information in enterprises which do not work in productive industry. Such enterprises include official statistics. The p...

متن کامل

A Data Warehouse/OLAP Framework for Web Usage Mining and Business Intelligence Reporting

Web usage mining is the application of data mining techniques to discover usage patterns and behaviors from web data (clickstream, purchase information, customer information etc) in order to understand and serve e-commerce customers better and improve the online business. In this paper we present a general Data Warehouse/OLAP framework for web usage mining and business intelligence reporting. W...

متن کامل

gPrune: A Constraint Pushing Framework for Graph Pattern Mining

In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset constraints, structural constraints, such as density and diameter of a graph, are very hard to be pushed deep into the mining process. In this paper, we give the first comprehensive study on the pruning properties of bot...

متن کامل

A data warehouse/online analytic processing framework for web usage mining and business intelligence reporting

Web usage mining is the application of data mining techniques to discover usage patterns and behaviors from web data (clickstream, purchase information, customer information, etc.) in order to understand and serve e-commerce customers better and improve the online business. In this article, we present a general data warehouse/online analytic processing (OLAP) framework for web usage mining and ...

متن کامل

gSpan: Graph-Based Substructure Pattern Mining

We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which discovers frequent substructures without candidate generation. gSpan builds a new lexicographic order among graphs, and maps each graph to a unique minimum DFS code as its canonical label. Based on this lexicographic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012